Subshifts, Languages and Logic
نویسندگان
چکیده
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tilings. Conversely, we characterise logic fragments corresponding to various classes of infinite pictures (subshifts of finite type, sofic subshifts).
منابع مشابه
Subshifts, MSO Logic, and Collapsing Hierarchies
We use monadic second-order logic to define two-dimensional subshifts, or sets of colorings of the infinite plane. We present a natural family of quantifier alternation hierarchies, and show that they all collapse to the third level. In particular, this solves an open problem of [Jeandel & Theyssier 2013]. The results are in stark contrast with picture languages, where such hierarchies are usua...
متن کاملSubshifts and Logic: Back and Forth
We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings, and of universal sentences in terms of combinations of “pattern counting” subshifts. Conversely, we characterise logic fragments corresponding to various clas...
متن کاملDecidability and Universality of Quasiminimal Subshifts
We show that there exists a universal subshift having only a finite number of minimal subsystems, refuting a conjecture in [Delvenne, Kůrka, Blondel, ’05]. We then introduce the still smaller class of quasiminimal subshifts, having finitely many subsystems in total. With N-actions, their theory essentially reduces to the theory of minimal systems, but with Zactions, the class is much larger. We...
متن کاملTree algebra of sofic tree languages
We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of subshifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages: the finite type tree languages and the tree languages which are almost of finite type. Each class corresponds to a cla...
متن کاملA Class of Simple C-algebras Arising from Certain Nonsofic Subshifts
We present a class of subshifts ZN , N = 1, 2, . . . whose associated C∗-algebras OZN are simple, purely infinite and not stably isomorphic to any Cuntz-Krieger algebra nor to Cuntz algebra. The class of the subshifts is the first examples whose associated C∗-algebras are not stably isomorphic to any Cuntz-Krieger algebra nor to Cuntz algebra. The subshifts ZN are coded systems whose languages ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009